منابع مشابه
A Self-Modifying Theorem Prover
Theorem provers can be viewed as containing declarative knowledge (in the form of axioms and lemmas) and procedural knowledge (in the form of an algorithm for proving theorems). Sometimes, as in the case of commutative laws in a Knuth-Bendix prover, it is appropriate or necessary to transfer knowledge from one category to the other. We describe a theorem proving system that independently recogn...
متن کاملA Parametrised Version of Moser’s Modifying Terms Theorem
A sharpened version of Moser’s ‘modifying terms’ KAM theorem is derived, and it is shown how this theorem can be used to investigate the persistence of invariant tori in general situations, including those where some of the Floquet exponents of the invariant torus may vanish. The result is ‘structural’ and works for dissipative, Hamiltonian, reversible and symmetric vector fields. These results...
متن کاملModifying LaTeX
This document was produced in response to suggestions that the modification and distribution conditions for the files constituting the New Standard LTEX system should be similar to those implied by Version 2 of the GNU General Public Licence, as published by the Free Software Foundation.
متن کاملDigital Borsuk-Ulam theorem
The aim of this paper is to compute a simplicial cohomology group of some specific digital images. Then we define ringand algebra structures of a digital cohomology with the cup product. Finally, we prove a special case of the Borsuk-Ulam theorem fordigital images.
متن کاملSome Results on Baer's Theorem
Baer has shown that, for a group G, finiteness of G=Zi(G) implies finiteness of ɣi+1(G). In this paper we will show that the converse is true provided that G=Zi(G) is finitely generated. In particular, when G is a finite nilpotent group we show that |G=Zi(G)| divides |ɣi+1(G)|d′ i(G), where d′i(G) =(d( G /Zi(G)))i.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1988
ISSN: 0022-314X
DOI: 10.1016/0022-314x(88)90090-x